Extending latent semantic analysis to manage its syntactic blindness
نویسندگان
چکیده
Natural Language Processing (NLP) is the sub-field of Artificial Intelligence that represents and analyses human language automatically. NLP has been employed in many applications, such as information retrieval, processing automated answer ranking. Semantic analysis focuses on understanding meaning text. Among other proposed approaches, Latent Analysis (LSA) a widely used corpus-based approach evaluates similarity text based semantic relations among words. LSA applied successfully diverse systems for calculating texts. ignores structure sentences, i.e., it suffers from syntactic blindness problem. fails to distinguish between sentences contain semantically similar words but have opposite meanings. Disregarding sentence structure, cannot differentiate list keywords. If words, comparing them using would lead high score. In this paper, we propose xLSA, an extension overcome problem original approach. xLSA was tested pairs significantly different meaning. Our results showed alleviates problem, providing more realistic scores.
منابع مشابه
Query expansion based on relevance feedback and latent semantic analysis
Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...
متن کاملProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two{mode and co-occurrence data, which has applications in information retrieval and ltering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occu...
متن کاملLatent Semantic Analysis (Tutorial)
We will see that the number of eigenvalues is n for an n× n matrix. Regarding eigenvectors, if x is an eigenvector then so is ax for any scalar a. However, if we consider only one eigenvector for each ax family, then there is a 1-1 correspondence of such eigenvectors to eigenvalues. Typically, we consider eigenvectors of unit length. Diagonal matrices are simple, the eigenvalues are the entries...
متن کاملLatent Semantic Analysis
Latent Semantic Analysis (LSA) is a technique for comparing texts using a vector-based representation that is learned from a corpus. This article begins with a description of the history of LSA and its basic functionality. LSA enjoys both theoretical support and empirical results that show how it matches human behavior. A number of the experiments that compare LSA with humans are described here...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems With Applications
سال: 2021
ISSN: ['1873-6793', '0957-4174']
DOI: https://doi.org/10.1016/j.eswa.2020.114130